Variants of the Min-Sum Link-Disjoint Paths Problem
نویسندگان
چکیده
A survivable connection usually requires computing link-disjoint primary and backup paths. Finding a min-sum pair of link-disjoint paths whose total cost is minimized can be solved in polynomial time. However, adding extra requirements may render the problem NP-complete. In this paper, we study different variants of the min-sum link-disjoint paths problem. We examine the complexity of these problem variants and provide exact and heuristic algorithms for them.
منابع مشابه
Complexity and Approximation Results for the Min-Sum and Min-Max Disjoint Paths Problems
Given a graph G = (V,E) and k source-sink pairs {(s1, t1), . . . , (sk, tk)} with each si, ti ∈ V , the Min-Sum Disjoint Paths problem asks to find k disjoint paths connecting all the source-sink pairs with minimized total length, while the Min-Max Disjoint Paths problem asks for k disjoint paths connecting all the sourcesink pairs with minimized length of the longest path. We show that the wei...
متن کاملOn the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems
GivenagraphG = (V,E) andk source-sinkpairs{(s1, t1), . . . , (sk, tk)} with each si, ti ∈ V , the Min-Sum Disjoint Paths problem asks k disjoint paths to connect all the source-sink pairs with minimized total length, while the Min-Max Disjoint Paths problem asks also k disjoint paths to connect all source-sink pairs but with minimized length of the longest path. In this paper we show that the w...
متن کاملOn Shortest Disjoint Paths in Planar Graphs
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path from si to ti for each i = 1, . . . , k. In the corresponding optimization problem, the shortest disjoint paths problem, the vertex-disjoint paths Pi have to be chosen such that a given objective function is minimized. We...
متن کاملEfficient calculation of the most reliable pair of link disjoint paths in telecommunication networks
In transmission networks an important routing problem is to find a pair of link disjoint paths which optimises some performance measure. In this paper the problem of obtaining the most reliable pair of link disjoint paths, assuming the reliability of the links are known, is considered. This is a non-linear optimisation problem. It is further introduced the constraint that the length of the path...
متن کاملPacking Non-Zero A-Paths In Group-Labelled Graphs
Let G=(V,E) be an oriented graph whose edges are labelled by the elements of a group Γ and let A⊆V . An A-path is a path whose ends are both in A. The weight of a path P in G is the sum of the group values on forward oriented arcs minus the sum of the backward oriented arcs in P . (If Γ is not abelian, we sum the labels in their order along the path.) We are interested in the maximum number of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009